翻訳と辞書
Words near each other
・ Godsway Donyoh
・ Godswill Akpabio
・ Godtfred Holmvang
・ Godtfred Kirk Christiansen
・ Godtfred Olsen
・ Godtfred Rump
・ Godthaab Church, Copenhagen
・ Godthul
・ Godthåbhallen
・ Godtube
・ Godumakunta
・ Godumalai
・ Godunov
・ Godunov map
・ Godunov's scheme
Godunov's theorem
・ Godurowo
・ Godus
・ Goduša, Montenegro
・ Godveerdegem
・ Godward
・ Godwari dialect
・ GodWars
・ Godwheel
・ Godwick
・ Godwin
・ Godwin (bishop)
・ Godwin (Korede Bello song)
・ Godwin Abadaki
・ Godwin Abbe


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Godunov's theorem : ウィキペディア英語版
Godunov's theorem
In numerical analysis and computational fluid dynamics, Godunov's theorem — also known as Godunov's order barrier theorem — is a mathematical theorem important in the development of the theory of high resolution schemes for the numerical solution of partial differential equations.
The theorem states that:
:''Linear numerical schemes for solving partial differential equations (PDE's), having the property of not generating new extrema (monotone scheme), can be at most first-order accurate.''
Professor Sergei K. Godunov originally proved the theorem as a Ph.D. student at Moscow State University. It is his most influential work in the area of applied and numerical mathematics and has had a major impact on science and engineering, particularly in the development of methods used in computational fluid dynamics (CFD) and other computational fields. One of his major contributions was to prove the theorem (Godunov, 1954; Godunov, 1959), that bears his name.
==The theorem==
We generally follow Wesseling (2001).
Aside
Assume a continuum problem described by a PDE is to be computed using a numerical scheme based upon a uniform computational grid and a one-step, constant step-size, ''M'' grid point, integration algorithm, either implicit or explicit. Then if x_ = j\,\Delta x \ and t^ = n\,\Delta t \ , such a scheme can be described by
:
\sum\limits_^ \varphi _^ = \sum\limits_^ .
\quad \quad ( 1)
In other words, the solution \varphi _j^ \ at time n + 1 and location j is a linear function of the solution at the previous time step n. We assume that \beta _m \ determines \varphi _j^ \ uniquely. Now, since the above equation represents a linear relationship between \varphi _j^ \ and \varphi _j^ \ we can perform a linear transformation to obtain the following equivalent form,
:\varphi _j^ = \sum\limits_m^ . \quad \quad ( 2)

Theorem 1: ''Monotonicity preserving''
The above scheme of equation (2) is monotonicity preserving if and only if
:\gamma _m \ge 0,\quad \forall m . \quad \quad ( 3)
''Proof'' - Godunov (1959)
Case 1: (sufficient condition)
Assume (3) applies and that \varphi _j^n \ is monotonically increasing with j \ .
Then, because \varphi _j^n \le \varphi _^n \le \cdots \le \varphi _^n it therefore follows that \varphi _j^ \le \varphi _^ \le \cdots \le \varphi _^ \ because
:
\varphi _j^ - \varphi _^ = \sum\limits_m^ ^n } \right)} \ge 0 . \quad \quad ( 4)
This means that monotonicity is preserved for this case.
Case 2: (necessary condition)
We prove the necessary condition by contradiction. Assume that \gamma _p^^ = \sum\limits_m^M \left( - \varphi _^ } \right) = \left\c}
& \\
& \\
\end} \right . \quad \quad ( 6)
Now choose j=k-p \ , to give

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Godunov's theorem」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.